class Solution:
    def countSymmetricIntegers(self, low: int, high: int) -> int:
        ans = 0
        for i in range(low, high + 1):
            istr = str(i)
            if (L := len(istr)) & 1 == 0:
                ia = list(map(int, istr))
                ans += sum(ia[: L // 2 :]) == sum(ia[L // 2 : :])
        return ans
